Extracting Goal Orderings to Improve Partial-Order Planning
نویسندگان
چکیده
The common wisdom that goal orderings can be used to improve planning performance is nearly as old as planning itself. During the last decades of research several approaches emerged that computed goal orderings for diierent planning paradigms, mostly in the area of state-space planning. For partial-order, plan-space planners goal orderings have not been investigated in much detail. Mechanisms developed for state-space planning are not directly applicable because partial-order planners do not have a current (world) state. Further, it is not completely clear how plan-space planners should make use of goal orderings. This paper describes an approach to extract goal orderings to be used by the plan-space planner CAPlan. The extraction of goal orderings is based on the analysis of an extended version of operator graphs which previously have been found useful for the analysis of interactions and recursion of plan-space planners.
منابع مشابه
Goal Ordering Extraction and Abstract Method
Planning is a class of complex problem. It is a way to improve the efficiency of planning algorithm in extracting and using goal orderings. Because deciding goal orderings is also PSPACE-complete, it is necessary to extract goal orderings efficiently when using goal orderings. The paper presents a method, called GOWN (goal ordering with invariants) and uses state invariants to extract goal orde...
متن کاملExtending Problem Speci cations for Plan-Space Planners
Problem speciications for classical planners based on a STRIPS-like representation typically consist of an initial situation and a partially deened goal state. Hierarchical planning approaches, e.g., Hierarchical Task Network (HTN) Planning, have not only richer representations for actions but also for the representation of planning problems. The latter are deened by giving an initial state and...
متن کاملUsing Disjunctive orderings instead of Conflict Resolution in Partial order planning
Resolving conflicts in partial order planning by means of promotion and demotion has been an standard idea in least commitment planning for over twenty years. Recent analyses of partial order planning show that promotion/demotion refinements are optional from the point of view of completeness. Furthermore, promotion/demotion refinements run counter to the idea of least-commitment since the plan...
متن کاملPartial Orderings and Scale-spaces with Monotonicity of Features
Signal simplification, as measured through a reduction in signal features is an important aspect of scale-space theories. Partial ordering can be seen as a formal characterization of the notion of a simpler version of a signal. The partial orderings implied by some scale-spaces which obey monotonicity of features are examined with examples drawn from 1-D Gaussian scale-space and Multiscale Dila...
متن کاملOn Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
The paper addresses the problem of computing goal orderings, which is one of the longstanding issues in AI planning. It makes two new contributions. First, it formally de nes and discusses two di erent goal orderings, which are called the reasonable and the forced ordering. Both orderings are de ned for simple STRIPS operators as well as for more complex ADL operators supporting negation and co...
متن کامل